Cyclic Scheduling of Multimodal Concurrently Flowing Processes

The problem of cyclic scheduling of multimodal concurrent processes (MCPs) is considered. Processes composed of sub-sequences of local cyclic processes (LCPs) are treated as multimodal processes, e.g. in case local processes encompass the subway lines network the relevant multimodal processes can be seen as passengers traveling itineraries this network. Since LCPs network implies a MCPs behavior, the following fundamental questions arise: Does the given LCPs network guarantee an assumed cyclic schedule of the MCPs at hand? Does there exist the LCPs network such that an assumed cyclic schedule of MCPs can be achieved? In that context our contribution is to propose a declarative framework allowing one to take into account both direct and reverse problems formulation.